Borrowing - proofness

نویسندگان

  • William Thomson
  • Julio Gonzalez-Diaz
  • Eun Jeong Heo
چکیده

We formulate and study the requirement on an allocation rule that no agent should be able to benefit by augmenting his endowment through borrowing resources from the outside world (alternatively, by simply exaggerating it). We show that the Walrasian rule is not “borrowing-proof” even on standard domains. More seriously, no efficient selection from the endowments-lower-bound correspondence, or from the no-envy-in-trades correspondence, or from the egalitarianequivalent-in-trades correspondence is borrowing-proof. These impossibilities hold even on the domain of economies with homothetic preferences. Key-works: borrowing-proofness. Endowment lower bound. No-envy-intrades. Egalitarian-equivalent-in-trades. JEL classification numbers:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Borrowing-proofness of the Lindahl rule in Kolm triangle economies

In the context of a simple model of public good provision, we study the requirement on an allocation rule that it be immune to manipulation by augmenting one’s endowment through borrowing from the outside world. We call it open-economy borrowing-proofness (Thomson, 2009). We ask whether the Lindahl rule satisfies the property. The answer is yes on both the domain of quasi-linear economies and o...

متن کامل

Rochester Borrowing-proofness Borrowing-proofness

We formulate and study the requirement on an allocation rule that no agent should be able to benefit by augmenting his endowment through borrowing resources from the outside world (alternatively, by simply exaggerating it). We show that the Walrasian rule is not “borrowing-proof” even on standard domains. More seriously, no efficient selection from the endowments-lower-bound correspondence, or ...

متن کامل

No . 629 PAIRWISE STRATEGY - PROOFNESS AND SELF - ENFORCING MANIPULATION *

“Strategy-proofness” is one of the axioms that are most frequently used in the recent literature on social choice theory. It requires that by misrepresenting his preferences, no agent can manipulate the outcome of the social choice rule in his favor. The stronger requirement of “group strategy-proofness” is also often employed to obtain clear characterization results of social choice rules. Gro...

متن کامل

A decomposition of strategy-proofness

Strategy-proofness has been one of the central axioms in the theory of social choice. We find that strategy-proofness is decomposed into three axioms: top-restricted AM-proofness, weak monotonicity, and individual bounded response. Among them, individual bounded respose is not as defensible as the other two, and we present possibility results by excluding individual bounded response from strate...

متن کامل

Impossibilities for probabilistic assignment

We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005